Approximating General Logic Programs

Approximating Answer Sets of Unitary Lifschitz-Woo Programs

We investigate several techniques for approximation of answer sets for a subclass of general logic programs of Lifschitz and Woo. The class we consider consists of programs that are unitary, i.e. allow for a single literal in the head (negation as failure is allowed in those literals). We compare three different classes of approximations and obtain results on the relationship between these sche...

Aproximating the Well-Founded Semantics for Normal Logic Programs using Abstract Interpretation

The well-founded semantics for normal logic programs is deened in a constructive way through the use of a xpoint operator and in general is not computable. We propose an approach for approximating through abstract interpretation the concrete behavior of normal logic programs described by the well-founded semantics. We provide also an abstract well-founded semantics scheme, based on an abstract ...

Some Aspects of the Integration of Connectionist and Logic-Based Systems∗†

We discuss the computation by neural networks of semantic operators TP determined by propositional logic programs P over quite general many-valued logics T . We revisit and clarify the foundations of the relevant notions employed in approximating both TP and its fixed points when P is a first-order logic program.

Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates

In [3] we investigate the problem of defining a well-founded and stable semantics for programs with aggregates. Our work is based on Approximation Theory [1] which is a general algebraic framework for approximating non-monotone operators on a complete lattice L by approximating operators on the bi-lattice L. The theory identifies basic properties of the approximating operators and gives a metho...

Approximating the Success Set of Logic Programs Using Constrained Regular Types